Solvability in Asynchronous Environments II: Finite Interactive Tasks
نویسندگان
چکیده
Identifying what problems can be solved in a given distributed system is a central question in distributed computing. In this series of works, we study this question in the context of asynchronous fault tolerant systems that can execute consensus. These systems can be those executing deterministic protocols with access to a consensus routine or those running randomized error-free protocols. A previous work handled the class of distributed decision tasks. In these tasks, each processor receives one local input and has to respond with one local output. In an interactive distributed task each of n processors receives a sequence of local inputs and has to respond on line with an output for every new input (before getting its next input). Different processors can be at different stages concurrently, so that additional inputs are received by fast processors while slow processors are still working on early inputs. An interactive task is called finite if the number of local inputs (and outputs) is finite. Interactive tasks can neither be described as a single huge decision task nor be decomposed into distinct, independent decision tasks. The main result of this work is an exact characterization of the finite interactive tasks which can be solved by t-resilient protocols in either of the above two models. The major tool we use in the characterization is a directed acyclic graph that is associated with an interactive task. Properties of this graph are used to determine the resiliency of the task and to devise a “generic” resilient algorithm which solves such tasks. This generic algorithm can be viewed as a repeated, deterministic reduction to a consensus subroutine. This implies that any finite interactive task is solvable by randomized error-free protocols iff it is solvable by deterministic protocols with access to consensus.
منابع مشابه
Approaches to case analyses in synchronous and asynchronous environments
Approaches to case analyses in synchronous and asynchronous environments" (2008). Computer-mediated communication (CMC) tools can be used to integrate time-intensive tasks, such as case study analyses, more easily into formal learning environments. How students talk together online in CMC environments is an area that has not yet been thoroughly investigated. This paper extends findings from a p...
متن کاملThe Topology of Asynchronous Byzantine Colorless Tasks
In this paper, we extend the topological model that characterizes task solvability in crashfailure systems to colorless tasks in Byzantine asynchronous systems. We give the first theorem with necessary and sufficient conditions to solve arbitrary colorless tasks in such model, capturing the relation between the total number of processes, the number of faulty processes, and the topological struc...
متن کاملImpact of Dynamic Assessment on the Writing Performance of English as Foreign Language Learners in Asynchronous Web 2.0 and Face-to-face Environments
This study sought to investigate dynamic assessment (DA) - an assessment approach that embeds inter- vention within the assessment process and that yields information about the learner’s responsiveness to this intervention - and the writing performance of the second language (L2) learners in Web 2.0 contexts. To this end, pre and post-treatment writings of 45 par...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 29 شماره
صفحات -
تاریخ انتشار 1999